📕 subnode [[@s5bug/np complete]] in 📚 node [[np-complete]]
📓 garden/s5bug/np-complete.md by @s5bug

NP Complete

  • a problem that all other [[np]] problems can be reduced to
  • if you can solve the decision version in P-time, you can solve all decision problems in [[np]] in P-time
📖 stoas
⥱ context
To see links, go up to full node [[np-complete]].